Evolution of group-theoretic cryptology attacks using hyper-heuristics

Number Theoretic Algorithms and Cryptology

Data Clustering Using Grouping Hyper-heuristics

Grouping problems represent a class of computationally hard to solve problems requiring optimal partitioning of a given set of items with respect to multiple criteria varying dependent on the domain. A recent work proposed a general-purpose selection hyper-heuristic search framework with reusable components, designed for rapid development of grouping hyper-heuristics to solve grouping problems....

university course timetabling using graph-based hyper heuristics

university course timetabling is a complex optimizationproblem. there are many components like departments, faculties, rooms,and students making the problem huge and difficult to solve. eachcomponent enforces a set of normally conflicting constraints on thesolution space. the problem will be solved if courses are scheduled indifferent rooms and within some specific time slots such that a set of...

Batched Mode Hyper-heuristics

A common form of a hyper-heuristic is a method that controls a search process which uses neighbourhood operators. There have many studies showing that hyper-heuristics are reusable for solving unseen problem instances not only from a particular domain but also different problem domains without requiring any change. However, generally hyper-heuristics have been considered as part of time-contrac...

Constructing Constrained-Version of Magic Squares Using Selection Hyper-heuristics

A square matrix of distinct numbers in which every row, column and both diagonals has the same total is referred to as a magic square. Constructing a magic square of a given order is considered as a difficult computational problem, particularly when additional constraints are imposed. Hyper-heuristics are emerging high level search methodologies that explore the space of heuristics for solving ...